Monotonicity and independence axioms

Monotonicity axioms in approval-based multi-winner voting rules

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity with respect to the support is studied when the set of voters does not change and when new voters enter the election. For each of these two cases we consider a...

Relaxations of the matroid axioms I: Independence, Exchange and Circuits

Motivated by a question of Duval and Reiner about higher Laplacians of simplicial complexes, we describe various relaxations of the defining axioms of matroid theory to obtain larger classes of simplicial complexes that contain pure shifted simplicial complexes. The resulting classes retain some of the matroid properties and allow us to classify matroid properties according to the relevant axio...

On the consistency and independence of some set-theoretical axioms

In this paper by means of simple models it is shown that the five set-theoretical axioms of Extensionality, Replacement, Power-Set, SumSet, and Choice are consistent and that each of the axioms of Extensionality, Replacement, and Power-Set is independent from the remaining four axioms. Although the above results are known and can be found in part in [l], it is believed that this paper has some ...

On the independence of axioms in BL and MTL

We show by standard automated theorem proving methods and freely available automated theorem prover software that axiom (A2), stating that multiplicative conjunction implies its first member, is provable from other axioms in fuzzy logics BL and MTL without using axiom (A3), which is known to be provable from other axioms [1]. We also use freely available automated model generation software to s...

Axioms and Algorithms for Inferences Involving Probabilistic Independence